The Freedoms of Guarded Bisimulation
نویسنده
چکیده
Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi in [1]. Features otherwise known from modal logics are lifted to the richer setting of general relational structures. The leading idea in this generalisation is the relativisation of quantifiers to tuples that are guarded by relational atoms. In a sense that can be made precise for many specific issues, guarded logics relate to general relational structures and hypergraphs in much the same way that modal logics relate to Kripke structures and graphs. This is particularly apparent for the associated semantic equivalence games. Guarded bisimulation can be seen as derived from a hypergraph version of ordinary (modal) bisimulation for graph-like structures. Just like preservation under ordinary bisimulation accounts for much of the good model-theoretic behaviour of modal logics, so hypergraph bisimulation and guarded bisimulation are the keys to understanding the model theory of guarded logics [1, 3, 4]. Model constructions and transformations that are compatible with guarded bisimulation account for the malleability of models and the tractability of the finite and algorithmic model theory of various guarded logics. They can often be cast in terms of hypergraph constructions [5, 6]. Here I intend to survey and summarise a number of results in the light of such model constructions including some more recent developments from [2, 6]. Results to be surveyed include finite and small model properties, decidability results, complexity and expressive completeness issues. At the conceptual as well as at the technical level, guarded bisimulations and local versus global properties in the overlap patterns of (finite) hypergraph structures form one of the leading themes, and offer intriguing combinatorial challenges. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
A Lindström characterisation of the guarded fragment and of modal logic with a global modality
We establish a Lindström type characterisation of the extension of basic modal logic by a global modality (ML[∀]) and of the guarded fragment of first-order logic (GF) as maximal among compact logics with the corresponding bisimulation invariance and the Tarski Union Property.
متن کاملNotes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we consider any process algebra giving rise to a Probabilistic Transition System satisfying the condition of regularity and offering prefixing, interleaving, and guarded recursion, then the coarsest congruence that is contai...
متن کاملA Guarded negation
We consider restrictions of first-order logic and of fixpoint logic in which all occurrences of negation are required to be guarded by an atomic predicate. In terms of expressive power, the logics in question, called GNFO and GNFP, extend the guarded fragment of first-order logic and the guarded least fixpoint logic, respectively. They also extend the recently introduced unary negation fragment...
متن کاملDynamic Odds & Ends
Modal logic becomes action logic by adding programs as in propositional dynamic logic or the μ– calculus. Modal languages can be seen as decidable fragments of first-order logic that admit a natural bisimulation, and hence enjoy a good model theory. Recently, much stronger 'guarded fragments' of firstorder logic have been identified that enjoy the same pleasant features. The latter can serve as...
متن کاملProbabilistic Role Models and the Guarded Fragment
We propose a uniform semantic framework for interpreting probabilistic concept subsumption and probabilistic role quantification through statistical sampling distributions. This general semantic principle serves as the foundation for the development of a probabilistic version of the guarded fragment of first-order logic. A characterization of equivalence in that logic in terms of bisimulations ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011